ISAR image analysis and recovery with unavailable or heavily corrupted data
نویسندگان
چکیده
منابع مشابه
Exact Recovery of Chaotic Systems from Highly Corrupted Data
Learning the governing equations in dynamical systems from time-varying measurements is of great interest across different scientific fields. This task becomes prohibitive when such data is moreover highly corrupted, for example, due to the recording mechanism failing over unknown intervals of time. When the underlying system exhibits chaotic behavior, such as sensitivity to initial conditions,...
متن کاملMR Image Reconstruction from Sparse and Corrupted k-Space Data
This paper reviews resampling of nonuniformly sampled k-space data to a Cartesian grid and adds a new formula enabling quick computation of the shape parameter B of the KaiserBessel convolution window. In addition, a very recently conceived iterative estimation of the sampling density correction is explained and applied to sparse radial MRI scans. Keywords— rapid scanning, undersampling, griddi...
متن کاملData recovery from corrupted observations via l1 minimization
This paper studies the problem of recovering a signal vector and the corrupted noise vector from a collection of corrupted linear measurements through the solution of a l1 minimization (2.1.2), where the sensing matrix is a partial Fourier matrix whose rows are selected randomly and uniformly from rows of a full Fourier matrix. After choosing the parameter in (2.1.2) appropriately, we show that...
متن کاملApproximate models for aggregate data when individual-level data sets are very large or unavailable.
In this article, we study a Bayesian hierarchical model for profiling health-care facilities using approximately sufficient statistics for aggregate facility-level data when the patient-level data sets are very large or unavailable. Starting with a desired patient-level model, we give several approximate models and the corresponding summary statistics necessary to implement the approximations. ...
متن کاملRecovery of Corrupted Multiple Kernels for Clustering
Kernel-based methods, such as kernel k-means and kernel PCA, have been widely used in machine learning tasks. The performance of these methods critically depends on the selection of kernel functions; however, the challenge is that we usually do not know what kind of kernels is suitable for the given data and task in advance; this leads to research on multiple kernel learning, i.e. we learn a co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Aerospace and Electronic Systems
سال: 2015
ISSN: 0018-9251
DOI: 10.1109/taes.2015.140413